Chromatic-Index-Critical Graphs of Orders 11 and 12
نویسندگان
چکیده
منابع مشابه
Chromatic Index Critical Graphs of Orders 11 and 12 Program in Applied and Computational Mathematics
A chromatic-index-critical graph G on n vertices is non-trivial if it has at most bn2 c edges. We prove that there is no chromatic-index-critical graph of order 12, and that there are precisely two non-trivial chromatic index critical graphs on 11 vertices. Together with known results this implies that there are precisely three non-trivial chromaticindex-critical graphs of order 12.
متن کاملChromatic-index-critical graphs of orders 13 and 14
A graph is chromatic-index-critical if it cannot be edge-coloured with ∆ colours (with ∆ the maximal degree of the graph), and if the removal of any edge decreases its chromatic index. The Critical Graph Conjecture stated that any such graph has odd order. It has been proved false and the smallest known counterexample has order 18 [18, 31]. In this paper we show that there are no chromatic-inde...
متن کاملVertex-splitting and Chromatic Index Critical Graphs
We study graphs which are critical with respect to the chromatic index. We relate these to the Overfull Conjecture and we study in particular their construction from regular graphs by subdividing an edge or by splitting a vertex. In this paper, we consider simple graphs (that is graphs which have no loops or multiple edges). An edge-colouring of a graph G is a map 4 : E(G) -+ cp, where cp is a ...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملTotal-Chromatic Number and Chromatic Index of Dually Chordal Graphs
A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly chordal graphs and interval graphs. We prove that Vizing's total-colour conjecture holds for dually chordal graphs. We describe a new heuristi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1998
ISSN: 0195-6698
DOI: 10.1006/eujc.1998.0254